Complexity of word problems for HNN-extensions
نویسندگان
چکیده
The computational complexity of the word problem in HNN-extension groups is studied. a fundamental construction combinatorial group theory. It shown that for an ascending H logspace reducible to so-called compressed H. main result paper states hyperbolic with cyclic associated subgroups can be solved polynomial time. This easily extended graphs vertex and edge groups.
منابع مشابه
N ov 2 00 8 Compressed word problems in HNN - extensions and amalgamated products
It is shown that the compressed word problem for an HNNextension 〈H, t | tat = φ(a)(a ∈ A)〉 with A finite is polynomial time Turing-reducible to the compressed word problem for the base group H . An analogous result for amalgamated free products is shown as well.
متن کاملPerfect Subgroups of Hnn Extensions
This note includes supporting material for Guilbault’s one-hour talk summarized elsewhere in these proceedings. We supply the group theory necessary to argue that Guilbault’s tame ends cannot be pseudocollared. In particular, we show that certain groups (the interated Baumslag-Solitar groups) cannot have any non-trivial perfect subgroups. The absence of non-trivial perfect subgroups, in turn, e...
متن کاملAn Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation
— A wellknown methodfor solving the word problem of a Jinite presented group given as HNN extension G* = (G, a; âua = (p(u),ueU > is to reduce it to the word problem of G by means ofan a-reductionfunction [1,3,4].// isshown that the complexity ofthisme thod dépends very strongly on the représentation ofG*. For any Grzegorczyck class S n, the complexity of the method applied to G* as above may b...
متن کاملHnn Extensions of Von Neumann Algebras
Reduced HNN extensions of von Neumann algebras (as well as C-algebras) will be introduced, and their modular theory, factoriality and ultraproducts will be discussed. In several concrete settings, it will be illustrated how our results can be applied.
متن کاملTheories of HNN-Extensions and Amalgamated Products
It is shown that the existential theory of G with rational constraints, over an HNN-extension G = 〈H, t; tat = φ(a)(a ∈ A)〉 is decidable, provided that the same problem is decidable in the base group H and that A is a finite group. The positive theory of G is decidable, provided that the existential positive theory of G is decidable and that A and φ(A) are proper subgroups of the base group H w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2023
ISSN: ['1090-2724', '0022-0000']
DOI: https://doi.org/10.1016/j.jcss.2023.02.005